Plane-Sweep Incremental Algorithm: Computing Delaunay Tessellations of Large Datasets

We present the plane-sweep incremental algorithm, a hybrid approach for computing Delaunay tessellations of large point sets whose size exceeds the computer’s main memory. This approach unites the simplicity of the incremental algorithms with the comparatively low memory requirements of plane-sweep approaches. The procedure is to first sort the point set along the first principal component and then to sequentially insert the points into the tessellation, essentially simulating a sweeping plane. The part of the tessellation that has been passed by the sweeping plane can be evicted from memory and written to disk, limiting the memory requirement of the program to the ”thickness” of the data set along its first principal component. We implemented the algorithm and used it to compute the Delaunay tessellation and Voronoi partition of the Sloan Digital Sky Survey magnitude space consisting of 287 million points. ∗[email protected] 1 ar X iv :1 21 0. 35 95 v1 [ cs .C G ] 1 2 O ct 2 01 2